Validation of Network Devices

ABSTRACT

A system and method for actively validating a network device is provided. Nodes in a network game community are prompted to engage in interrogation and response to facilitate the identification of nodes operating with hacked, modified and non-typical game configurations. In one embodiment, a query is presented to a user&#39;s machine which triggers a response, and where the response indicates whether certain data at the user is valid and wherein invalid data is suggestive of illegal community behavior. Functions are triggered and data is queried to determine whether the state of game environment is operating according to known metrics or constraints. Various queries to test user integrity include memory peeks, confirmation of location of functions in memory, memory hashing, profiling of threads operating on the user machine, and combinations thereof. Queries may be actively initiated by a server, peer, peer group or combinations thereof and may be scheduled on a routine basis, triggered in response to passive listening, and via collaborating users who suspect cheat activity.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation and claims the priority benefit of U.S. patent application Ser. No. 11/386,039 filed Mar. 20, 2006 and entitled “Active Validation of Network Devices,” the disclosure of which is incorporated herein by reference.

The present application is related to U.S. patent application Ser. No. 11/415,881 filed May 1, 2006 and entitled “Passive Validation of Network Devices”; U.S. patent application Ser. No. 11/449,141 filed Jun. 7, 2006 and entitled “Game Metrics”; and U.S. patent application Ser. No. 11/725,175 filed Mar. 16, 2007 and entitled “Maintaining Community Integrity.”

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates, generally, to network gaming and more particularly to systems and methods for validating game users and devices in a network community of game players.

2. Description of Related Art

Conventionally, users of electronic games compete with one another by selecting a two-player option associated with a particular electronic game via a single home gaming console. Accordingly, two players can play at the same time or one-at-a-time in order to compete for points or other awards associated with the particular electronic game.

As electronic game consoles have become more popular and network technologies have become more pervasive, more options for head-to-head competition are provided. Some electronic game consoles are equipped with modems or other network connectors for allowing users to communicate over a network through the exchange of data related to the game. By communicating over a network, users can connect to various other users' gaming consoles either directly or via intermediate computing nodes (e.g., a central server or other game consoles in a network) and compete against those various other users while playing a network game.

Disadvantageously, some users manipulate the network game in order to gain unfair advantages while competing with other users playing the same network game. For example, a user may slow or delay the rate at which the user's data is sent to other users so that the various other users do not receive the user's data in time to react appropriately.

Unscrupulous users may employ an external hardware device that manipulates the generation of or access to certain game data whereby a game character may be endowed with special powers or abilities or attributes (e.g., lives, ammunition, and weapons) not genuinely earned during game play. Similarly, a game character may become impervious (e.g., invisible) to attacks by other game players.

Certain software methodologies exist (either alone or in conjunction with the aforementioned hardware devices) wherein code is temporarily or permanently installed and/or modified in a gaming device allowing for similar advantages. Various other means and methods are known and employed by users in order to cheat or gain an unfair advantage during the course of networked ‘community’ game-play.

Cheating decreases user enjoyment of participating in a networked community game environment. For example, a particular user playing a network game without any illicit outside aides (e.g., cheat codes, hacks and so forth) is at a distinct disadvantage versus a user who is making use of such illicit aides. The user who is not cheating may be overpowered, outgunned, or otherwise inferior in some respect to a user who is cheating regardless of the individual skills of those users. If the user who does not cheat is continually defeated by a user who does cheat—and often in quick and decisive fashion—the non-cheating user may lose interest in a particular game, a particular game network, or a particular product or service provider.

This loss of interest adversely affects game developers and network service providers who will sell less game titles or find fewer users utilizing their network game services, respectively. As such, there is an inherent interest for game developers, service providers and honest game users to identify and eliminate cheating in a network or community game environment.

SUMMARY OF THE INVENTION

The present invention provides a system and method for actively validating network game users with respect to engaging in unfair or illicit game play (i.e., cheating).

According to one embodiment of the present invention, at least one query is sent to one or more users to determine whether unfair, illicit or otherwise disingenuous game play has occurred or is in progress as reflected by certain data residing at the user's gaming device. A response to the at least one query is received whereby it is determined whether the one or more users are valid users (i.e., not cheating). The response to the at least one query is indicative of the nature of game play in progress (i.e., whether the at least one user is engaged in unfair game play activity).

Additional embodiments of the present invention advantageously allow for identification of hacking or modification of game data stores or game console hardware.

Other embodiments of the present invention allow for active validation of network game users through a server query, a peer query, a peer-group query or a combination thereof.

Still further embodiments of the present invention utilize a query that tests user integrity, such as confirming the location of functions in memory, memory hashing, profiling of threads operating on a user game console or combinations thereof.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a schematic diagram of an exemplary architecture for validating network users according to some embodiments of the present invention;

FIG. 2 illustrates a block diagram of an exemplary electronic entertainment system according to some embodiments of the present invention;

FIG. 3 illustrates an exemplary server or sending node according to some embodiments of the present invention;

FIG. 4 illustrates a flow diagram of an exemplary process for identifying illegal network game activity according to some embodiments of the present invention; and

FIG. 5 illustrates a flow diagram of an exemplary process for actively validating network game users according to some embodiments of the present invention.

DETAILED DESCRIPTION

FIG. 1 illustrates a schematic diagram of an exemplary architecture for validating network game users according to some embodiments of the present invention. One or more clients 102 include one or more network games 104. Network game 104 may be built-in (e.g., pre-loaded) to the client 102 or be introduced through an optical disk or other data storage medium. Network game 104 may also be obtained over a network as further discussed herein. The client 102 is connected to a server 108 via a communications network 106.

The client may comprise 102 a game console such as a PlayStation® 3, a laptop computing device, a portable game device such as the PlayStation® Portable, a desktop computing device, a cellular telephone, or any other device capable of executing the network game 104 and connecting to the network 106. In some embodiments, the client 102 is identified by an identification number such as a client ID or an address mechanism such as an IP address. In other embodiments, a user of the client 102 may ‘sign on’ to a network with a user name and/or password and may be temporarily associated with the client 102.

In some embodiments of the present invention, the server 108 includes the network game 104 and the clients 102 access the network game 104 on the server 108 via the network 106. The network game 104 on the server 108 may be the entire game, a portion of the game, data related to the game or simply a node allowing for the pass though, observation and/or collection of data related to the game as the game is played by users in the game community. The network game 104 may be similarly organized at various clients 102 (e.g., portions of the game or game data related to the game). Network game 104 may also be provided through, for example, a third-party content library server. In such an embodiment, the library server may or may not be a participating member of the validation architecture.

It should be understood that the reference to a client 102 and a server 108 is merely for the convenience of understanding the present invention. Embodiments of the present invention may be implemented in the context of a peer-to-peer network, a client-server network, or within a peer-group (e.g., a specified group of peers). Therefore, in some instances, a client 104 may function as a server 108 and vice versa depending on the timing and the nature of a data exchange. For example, various clients in a peer-to-peer network may each comprise a portion of a network game 104 or data related to that game and may send and receive the same. As such, any reference to a client 104 or a server 108 is meant to be inclusive of operations performed by one or both entities unless specified otherwise by a particular limitation in the claims. In some instances, a device with client/server functionality may be referred to by the generic moniker, ‘network node’ or ‘computing node.’ In that regard, client 102 and server 108 may both be considered network or computing nodes.

The network game 104 comprises any software that may be processed on or by the client 102 and that allows for communication and data exchanges with the other clients 102 and server 108 via the network 106. The network 106 may include, for example, the Internet. Other proprietary or closed networks may be used either exclusively or in conjunction with the Internet. Certain security protocols (e.g., SSL or VPN) or encryption methodologies may be used to ensure the security of data exchanges over network 106, especially if the network 106 is a publicly accessible network such as the Internet.

Users associated with each of the clients 102 can interact with other users playing the network game 104. Accordingly, the users at each of the clients 102 can compete with one another despite not being physically present with one another or sharing a common gaming device or console.

In one exemplary embodiment, the server 108 monitors the users playing the network game 104 via the network 106. The clients 102 can request data from the server 108, such as information pertinent to the particular network game 104 being played, bug patches, and so forth. Any type of communication exchange between the clients 102 and the server 108 is within the scope of the various embodiments. Further, in some embodiments of the present invention, more than one server 108 may be connected to the network 106 for the purpose of communicating with the clients 102. For example, back-up or redundancy servers as well as servers with particular tasks such as storing identification information or preferences related to a particular user as well as servers tasked with certain DRM, advertising, or payment responsibilities.

In other embodiments of the present invention, the clients 102 monitor the network games 104 being played by the other clients 102 (e.g., as individual nodes in a peer-to-peer network or peer-group network). The clients 102 can communicate data generated during the monitoring process to the server 108 or the clients 102 can store and process the data, themselves. For example, in a peer-to-peer network scenario, each of the nodes in the network can monitor other nodes in the network for certain illicit behaviors.

The validation process implemented by the server 108, clients 102, and/or any one of a variety of nodes in the network detects cheating or unusual activity with respect to the network game 104. For example, a game character may accrue more points than allowed or normally allotted, the game character may possess stronger powers than the network game 104 generally provides, and so forth. Any type of unusual behavior or activity may be detected via the monitoring process discussed herein (e.g., passive validation), as result of random queries (e.g., active validation) or a combination of the two (e.g., hybrid validation). Referring now to FIG. 2, a block diagram of one embodiment of an exemplary electronic entertainment system 200, such as may constitute client 102 and for playing the network game 104 in accordance with one embodiment of the invention is shown. The system 200 may comprise, but is not limited to, a main memory 202, a central processing unit (CPU) 206, vector processing units VU0 204 and VU1 208, a graphics processing unit (GPU) 210, all of which may be coupled via a bus 236 to an input/output processor (IOP) 212. The system 200 may also comprise an IOP memory 214, a controller interface 216, a memory card 218, a Universal Serial Bus (USB) interface 220, and an IEEE 1394 interface 222. The system 200 may further include an operating system read-only memory (OS ROM) 224, a sound processing unit (SPU) 226, an optical disc control unit 228, and a hard disc drive (HDD) 230, all of which may be connected via a bus 238 to IOP 212.

Some embodiments of the system 200 may also include a network adaptor 240, which may offer an Ethernet connection 242 and/or telephony connection 244. The system 200 is, in one embodiment, an electronic gaming console; however, the system 200 (or portions thereof) may also be implemented as a general-purpose computer, a set-top box, a hand-held gaming device, or in a mobile device such as a cellular phone. It should further be noted that various other system architectures may be utilized within the scope of the present invention. For example, the computer architecture and high speed processing model disclosed in U.S. patent publication number 2002-0138637 for a “Computer Architecture and Software Cells for Broadband Networks,” the disclosure of which is incorporated herein by reference.

The CPU 206, the VU0 204, the VU1 208, the GPU 210, and the IOP 212 communicate via a system bus 236. The CPU 206 communicates with the main memory 202 via a dedicated bus 234. The VU1 208 and the GPU 210 may also communicate with one another via a dedicated bus 232. The CPU 206 executes programs stored in the OS ROM 224 and the main memory 202. The main memory 202 may contain pre-stored programs and may also contain programs transferred via the IOP 212 from a CD-ROM, DVD-ROM, or other optical disc (not shown) using the optical disc control unit 228. The IOP 212 controls data exchanges between the CPU 206, the VU0 204, the VU1 208, the GPU 210 and other devices of the system 200, such as the controller interface 216, or from other such systems via the network adaptor 240.

The GPU 210 executes drawing instructions from the CPU 206 and the VU0 204 to produce images for display on a display device (not shown). The VU1 208 transforms objects from three-dimensional coordinates to two-dimensional coordinates, and sends the two-dimensional coordinates to the GPU 210. The SPU 226 executes instructions and processes data to produce sound signals that are output on an audio device (not shown). A user of the system 200 provides instructions via the controller interface 216 to the CPU 206, which may be coupled to a control device comprising a joystick, directional buttons, and/or other control buttons. For example, the user may instruct the CPU 206 to store certain game information on the memory card 218, which may be removable (e.g., a flash memory or other non-volatile memory card), or may instruct a character in a game to perform some specified action. Other devices may be connected to the system 200 via the USB interface 220 and the IEEE 1394 interface 222, such as an external hardware device allowing for illicit gaming behavior (i.e., cheating). Some embodiments of the system 200 may comprise a network adaptor 240. The network adaptor 240 provides the hardware functionality necessary for the system 200 to connect to a network. The network adaptor 240 may comprise, for example, a system connector that operates to connect the adaptor 240 to the system 200 through an expansion bus connector 246. The network adaptor 240 may also comprise a power connector and data connector to allow for the provisioning of power from the system 200 to the adaptor 240 and the exchange of data between the system 200 and the adaptor 240. In some embodiments of the present invention, the network adaptor 240 may also require the installation of certain software in the system 200 to allow for identification and connection to a particular IP address and/or dial-up to a particular Internet Service Provider. Software may also provide other functionalities, such as the creation and maintenance of user profiles, in addition to functional interaction between the system 200 and the network adaptor 240.

The network adaptor 240 may also comprise an Ethernet connection 242. Through the Ethernet connection 242, a network cable (e.g., a 100 Base-TX or 10-Base T) may be coupled to the network adaptor 240 for connection to a network. The network cable may, for example, be communicatively coupled to a DSL or cable modem. The network cable may also be communicatively coupled to, for example, a router via a LAN port; the router may then be coupled to a DSL or cable modem through a WAN port. In further embodiments, the Ethernet connection 242 may allow for a network cable to be connected to a wireless Ethernet bridge. The wireless Ethernet bridge may be communicatively coupled to a wireless router utilizing, for example, an 802.11x protocol. The wireless router may be further communicatively coupled to a cable or DSL modem.

The network adaptor 240 may also comprise a telephony connection 244. Through the telephony connection 244, a standard telephone line with, for example, an RJ-11C telephone connector may be connected to the network adaptor 240 and a telephone wall jack. In this regard, the network adaptor 240 may further comprise modem functionality such that the system 200 may communicate data over the public switched telephone network via the telephony connection 244.

Other network connection methodologies and system architectures may be implemented, like those disclosed in commonly owned U.S. patent application Ser. No. 10/059,837 for a “System and Method for Distributing Data between a Telephone Network and an Entertainment Network,” the disclosure of which is incorporated herein by reference.

FIG. 3 shows an exemplary network node, such as the server 104 discussed in FIG. 1, according to some embodiments of the present invention. An optional rules generator 302 creates and/or processes rules associated with the network game 104. The rules may include, for example, parameters for a game environment. In some embodiments, the rules include, but are not limited to, appropriate character fatigue, speed, character strength, goals, power, ammunition, temporal variables, score ranges, prerequisites for advancement, frequency, and so forth. A rule may encompass any quantifiable limitation of the game environment or a character in the game environment (e.g., a user starting a game with ten lives when the game defaults to three).

Similarly, rules may encompass any identifiable aspect of the gaming environment or the hardware and/or software related to generating that environment. For example, the overwriting or modification of certain code in main memory 202, the presence of certain hardware devices with a particular device signature present in system 200 via USB Interface 220 or IEEE 1394 Interface 222 or the presence of certain data on a memory card 218 may be subject to a rule (e.g., prohibiting the presence of devices evidencing a particular signature). The receipt of or presence of remnants of certain instruction threads including number, location or specific characteristics in, for example, main memory 202 or IOP memory 214 may also be subject to rules validation (e.g., cheating may not immediately be occurring but the presence of prior instruction threads related to cheating indicate cheating did at one point occur). The blocking of the transmission or receipt of particular data via network adaptor 240 may also constitute the basis for a rule (e.g., prohibitions of particular data transfers indicate cheating).

Rules are inclusive and may be independently generated by the optional rules generator 302 or otherwise related to data provided to the rules generator 302 (e.g., by a game developer). Optional rules generator 302, in this regard, may observe (e.g., through monitoring module 306) certain game parameters and develop a rule based on its observations of a particular network game 104. For example, the generator 302 may observe that gaining access to a particular level always requires meeting certain prerequisites. The generator 302 may develop a rule reflecting that if a user has achieved access to that particular level and has not met those prerequisites, that user is cheating. Those prerequisites may be observed by the generator 302 and/or related to information provided to the generator 302.

A rules library 304 is provided for storing the pre-defined or generated rules. Various other data may be stored in the rules library 304 according to some embodiments of the present invention. For example, statistics about one or more users of the network game 104 may be stored in the rules library 304, or any other storage medium or locale, according to some embodiments of the present invention. Alternative storage of statistics or other information may occur remotely from a network node but is otherwise accessible via the network 106. In some embodiments, the rules are directly input into the rules library 304 or may have been independently or cooperatively developed by the rules generator 302.

A monitoring module 306 may be configured to monitor user activity with the network game 104 at the client 102 via data exchanges with the server 104 via the network 106. Any type of monitoring may be implemented by the monitoring module 306 (e.g., periodic review of data exchanges, constant review of data exchanges, review of data exchanges from particular nodes, etc.). According to one embodiment of the present invention, the monitoring module 306 utilizes rules in the rules library 304 and analysis provided by the analysis engine 308 to passively listen for or detect user activity that deviates from typical user activity associated with the network game 104.

For example, the rules may indicate how fast a character associated with the network game 104 can move. The monitoring module 306 may observe characters in the network game 104 moving in excess of that speed and may flag one or more characters that moves faster than the rules indicate is allowed for further investigation or resolution. The monitoring module may (e.g., in hybrid validation architecture) independently activate the query engine 310 in light of this apparently illicit activity that suggests cheating and cause the query engine 310 to deliver a query to the apparently offending node to better determine whether the node is in a valid or invalid state. Such activity is referred to a hybrid validation in that validation begins passively (i.e., no active query to the offending node) but upon identification of possible illicit behavior, a query, which is generally indicative of active validation, is delivered to the offending node for a more accurate determination of valid or invalid behavior. The combination of passive (further described herein) and active validation, together, constitutes hybrid validation.

In some embodiments (e.g., in passive validation architecture), the apparently offending node may be summarily removed from the network without further investigation or data pertaining to this apparently illicit activity is logged for future use and/or analysis. Such activity is referred to as passive validation in that no proactive determination of validity is made; the determination occurs as a result of ‘listening’ to behavior at the node.

The monitoring module 306, in some embodiments—including both passive and hybrid validation—may forward any flags or unusual activity to the analysis engine 308. The analysis engine 308 may analyze the flagged activity to determine whether the activity is, in fact, illegal with respect to the game environment constraints of the network game 104. In other words, the analysis engine 308 determines whether the user activity, in fact, violates the rules associated with the network game 104.

For example, the network game user playing the network game 104 may play a nearly perfect game, such as achieving higher than usual scores. While, in many cases, this may be indicative of cheating, the user may simply be an above-average player. Data stored at the analysis engine 308, the rules library 304 or in another data storage locale or means (e.g., an ongoing record of particular game player activity and indicating an ongoing increase in quality of play over several sessions) may be utilized to make a determination whether this player is per se cheating or if further investigation via a query from query engine 310 is appropriate.

Analysis engine 308 may also determine that while a user of a network game 104 presently has a particular advantage, this advantage may be one actually granted by the developer of the network game 104. For example, the game developer may have implanted an ‘Easter Egg’ or other ‘hidden’ functionality or bonus in the game environment such as temporary invincibility or excess speed. Certain bonus codes may also be recognized by the network game 104 and allow for game character or game environment enhancements. The analysis engine 308, through a query to the rules library 304, may determine that this particular behavior—while in any other context of the game would constitute cheating—is, in fact, permitted since the user has uncovered the Easter Egg or otherwise input an authorized code providing for such enhanced ability. The analysis engine 308 may also determine whether such enhanced functionalities have been disabled with regard to a particular network game environment and whether that activity, in light of that condition having been presently disabled, therein constitutes cheating.

The analysis engine 308 and/or the monitoring module 306, depending upon a particular embodiment, may then instruct the query engine 310 to send one or more queries to the user's game device (system 200) in order to gather data that helps the analysis engine 308 determine whether the user activity qualifies as cheating. The query engine 310 may send predetermined queries for the particular network game 104 or the query engine 310 may generate specific queries for the network game 104 based on the user activity that is flagged by the monitoring module 306.

For example, if the flagged behavior is one that is usually coupled with a particular cheat device (e.g., an external hardware mechanism), the query engine 310 may send a query to the client 102 seeking processor threads related to that device or seek a hash of memory that is traditionally modified by that device.

The query engine 310 generates and sends queries to the client 102 on which the network game 104 is being played or that is otherwise connected to the server 108 to play the network game 104. Based on a the response to the query, analysis engine 308 determines whether a client 102 or other network node is presently, has been or is otherwise configured to engage in illegal behavior (i.e., cheating).

Queries generated by the query engine 310 are, in one exemplary embodiment, asynchronous in that they may be generated and delivered at any time. Other embodiments of the present invention, however, may utilize a particular schedule or time-table for the delivery of queries in order to, for example, optimize consumption of bandwidth. Accordingly, a query may only be generated when bandwidth consumption relative to a particular network game 104 is at an ebb versus during a high computational, high data exchange point of game play. Similarly, queries may be scheduled subject to the number of nodes present in a network; upon entry of new nodes to the network; or upon any other schedule as may be implemented by an administrator of the validation architecture.

Each node in the gaming community (e.g., client 102) is configured to receive the query and respond as set forth by a series of instructional headers in the query packet. Providing incorrect or invalid data in response to the query is construed as illicit behavior (i.e., cheating) and the invalid node may be dismissed from the community, logged, or otherwise dealt with as is determined by the particular construct of the validation architecture in place in a given community or with regard to a particular network game 104.

Failure of any particular node to respond to the query may be implicitly construed as an invalid response (i.e., the queried node did not respond because that node does not possess or cannot calculate the proper responsive data). Each query, as a part of the aforementioned instruction packet header, may reflect a time period in which a response must be generated and transmitted to the sending node. In other embodiments, the sending node may simply time the response of the query and unilaterally determine that a lack of response within a particular period of time constitutes an invalid response and therefore invalidate the queried node.

In certain networks, delivery of a response may be delayed or impossible due to a number of factors. For example, in a high traffic network, the proper and valid response may be generated by a queried node but temporarily delayed by the network due to traffic or other data priorities (e.g., the delivery of critical game data). The querying node may be configured to recognize when certain traffic conditions exist in the network and to adjust (via query engine 310) the query response time for providing a valid response.

Similar adjustments or allowances may be made in light of the particular network over which a queried node is connected to the querying node (e.g., a DSL line v. a wireless network v. a 56 kbps dial-up modem). A query and response are, at least with regard to a valid node, more readily transmitted and received over a DSL line, which comprises higher bandwidth than, for example, a dial-up modem. Similarly, if certain lightweight protocols are being used (e.g., UDP versus TCP), additional leniency may be allowed in that UDP, for example, offers few error recovery services unlike TCP, which guarantees delivery of data packets. In such a scenario, the query packet may never be received by the queried node and no indication of that failure will be communicated to the querying node. The querying node, via query engine 310, may take such possibilities into consideration, in conjunction with analysis engine 308, when determining if a response has been timely received and, further, with regard to disposing of an implicitly invalidated node.

In other embodiments of the present invention, if no response is received in response to a query, the query engine 310 may re-transmit the same query or, in order to prevent an illicit network node from having the benefit of additional processing time to determine the correct response to the query, generate a fresh query to that node. A particular node may be given so many opportunities to provide a valid response before the node is dismissed from the network or otherwise cataloged as having engaged in illicit community behavior.

The query itself is intended to determine whether a node in the community network is valid, that is, is the node running instructions or functioning as is expected (e.g., has the runtime code been modified). Various cheating mechanisms will introduce new code to the system 200, usually in main memory 202 or IOP memory 214 although code related to illicit activity may also be found on a memory card 218. Certain device signatures related to a cheat device connected to the system 200 may further be identified at USB Interface 220 or IEEE 1394 Interface 1394 222. The query seeks to determine whether known ‘cheat’ code is present or whether certain native runtime code at, for example, main memory 202 or IOP memory 214, has been modified as the result of a user having executed certain cheat code or the presence of a certain cheat device and its related signature, that cheat code having modified the native runtime code.

The query generated by the query engine 310, in one embodiment, may comprise requesting a section of memory from the client 102, that is, a start address and size. The client 102 then answers the query with the appropriate number of bytes of memory commencing at the particular address as requested by the query engine 310. Query engine 310, in some embodiments, will request a limited number of memory addresses in that the query aims to identify known portions of runtime code that are traditionally subject to modification or hacking with an aim toward cheating in a community network environment.

If the client 102 fails to respond to the query or provides the incorrect segment of memory as a result of the runtime code having been altered by illicit behavior (i.e., cheating), then the client 102 may be dismissed from the network or subject to other penalties or action (e.g., logging of an IP address, development of a record reflecting the client 102 or an associated user having been engaged in illicit behavior, restriction of bandwidth, etc.). A validated node (e.g., client 102) will identify a portion of memory that matches the expectations of the querying node (e.g., server 104) as reflected by a rule in rules library 304.

In another embodiment, the query engine 310 may generate a query concerning memory in the context of a hash function and at the client 102 in question. A hash function (H) is a transformation that takes a variable-size input (m) and returns a fixed-size string, which is called the hash value h (i.e., h=H(m)). The hash value concisely represents the larger data sample from which it was computed.

In the context of an embodiment of the present invention, the query generated by query engine 310 may identify a particular address and portion of memory as in previous embodiments of the present invention but further require the application of a hash function against the relevant data in memory. The response to the query (i.e., the hashed portion of memory) would then be required to match the hash value at the querying node (e.g., server 104) as might be reflected in a lookup table in rules library 304.

Hashing, as noted above, may be utilized to transform a string of characters associated with the memory requested into a shorter fixed-length value or key representative of the string. Through the use of hashing, efforts of more sophisticated hackers and cheaters are complicated in that it is nearly impossible to re-establish the original data from the hash value. A hash value is unique in the sense that two data sets are highly unlikely to result in the same bit string and any attempt to make changes to the data will negate the value and thus the signature. A hash function H is one-way in that given a hash value h, it is computationally infeasible to find some input x such that H(x)=h.

For example, applying the CRC32 hash algorithm against the data string <Sony> results in the checksum <69D07CFC>; the data string <Sony Computer Entertainment>produces the checksum <EF7F99BA>; and the data string <Sony Computer Entertainment America Inc.> results in the unique checksum <E3DE35CF>.

Examples of well-known hash functions that may be implemented in the present invention are MD2 and MD5 as reflected in Internet RFCs 1320 and 1321, which are incorporated herein by reference as well as the Secure Hash Algorithm (SHA) as is reflected in FIPS PUB 180, which is further incorporated herein by reference. CRC32 (cyclic redundancy check) is still a further example of a hash function that may be implemented in an embodiment of the present invention. Other known or later developed hash functions are within the scope of various embodiments of the present invention.

While impossible to re-establish the original data from the hash value, since a query from query engine 310 may refer to a limited number of memory addresses, it is conceivable that a hacker or cheater could independently generate a look-up table in light of a particular hash algorithm vis-à-vis a particular address and size (sometimes referred to, generally in the context of hacking computer passwords, as a dictionary attack). Thus, when a query is received concerning a particular address and size and hash algorithm, the cheater may provide the appropriate response via their look-up table. In order to overcome this possibility, some embodiments of the present invention may utilize a certain degree of randomization as to the particular memory segments queried.

Further embodiments of the present invention, as a means of overcoming independent look-up tables, may employ salting the hash as a part of the query generated by query engine 310. Salt is, in its simplest form, a unique string of some fixed length and is provided as a part of the query in the header instructions of the query packet. The memory segment identified by the query is concatenated with the salt and subsequently hashed. The possibilities of ‘hacking’ a response to the query are diminished almost to the point of impossibility and the time and processing power required to develop an independent look-up table on-the-fly would far exceed the response time limit to the query and the client 102 would be timed out for failure to respond to the query. A proper response will, like the memory query and memory/hash query, provide a response that matches the hash value at the querying node. Failure of the response to match that hash value will result in the queried node being designated invalid and removed from the community or otherwise addressed as is appropriate in the particular validation architecture.

The query, in some embodiments of the present invention, may further include the detection of threads as they occur through the use of certain cheat devices. A processor thread is generally recognized as the architectural state within a processor representative of a sequence of instructions. Certain devices, when installed, will introduce a series of threads in certain numbers and in certain locales in order to allow for the operation of the device in conjunction with the system 200. A query of, for example, main memory 202 or IOP memory 214 at client 102 may be related to detection of a known thread, a known number of threads, or the presence of threads in a certain location as evidence of illicit game activity (i.e., cheating) as identified by rules library 304.

In some instances, even after certain devices are removed from the system 200, the various threads related to that device will not be entirely purged from the system 200, usually main memory 202 or IOP memory 214. A query of client 102 may relate to the detection of these so-called ‘ghost threads’ and indicate that while a user is not immediately engaged in illicit game behavior the user may have previously engaged in such behavior and/or otherwise have the means to engage in such behavior in the future.

Queries may also pertain to identification of modules and strings of data in the system 200 as identified in the rules library 304. As these modules and strings may ‘move,’ especially in IOP memory 214, identification of the particular string or module versus a particular address may prove particularly useful with regard to actively validating a network device. Further, the jump locations in a particular segment of code may be ‘nulled out’ whereby code that has been relocated as a normal part of the IOP operation may be verified.

While any one of the aforementioned embodiments may be utilized in the context of a query, the query engine 310 may automatically determine or customize the particular query in response to activity detected by monitoring module 306 as may be the case in of passive validation architecture.

The analysis engine 308 receives the data in response to the query generated by query engine 310 and determines whether the status of a client device is invalid and reflects cheating or other illicit behavior. If the client 102 fails to respond to the query from the query engine 310, the client 102 may be ejected from the network community either temporarily or permanently. In some embodiments of the present invention, the period a client 102 or a particular user associated with the client 102 at the time of ejection may increase with the number of ejections.

As previously noted, in some embodiments of the present invention, a window of time is specified for responding to the query. If the client 102 fails to respond to the query within that window of time, the server 108 may send another query, eject the user or client 102 from the network community, or allow the user to continue participating in the network game 104 and continue to monitor the user's activity at client 102.

In some embodiments of the present invention, like those related to passive validation, the analysis engine 308—in conjunction with monitoring module 306—may decide that the query engine 310 does not need to send a query. For example, the analysis engine 308 may determine that while a score associated with the network game 104 is high, it is not outside the parameters for scores set forth in the rules associated with the network game 104 as provided in the rules library 304 and otherwise observed by the monitoring module 306.

If the analysis engine 308 determines that the user is cheating, the offending node may be ejected, allowed to continue playing, and so forth. In some embodiments, the server 108 or sending node may resolve the violation (i.e., cheating activity) whereby various types of resolution may be employed. In some embodiments of the present invention, the node tasked with resolving the behavior (e.g., server 104) may disable a cheating device or offending code presently running on the system 200 by sending a patch to remove, modify, or add to the offending software.

In some embodiments, the analysis engine 308 may generate a list of users or client devices 102 that violate the rules associated with the network game 104. In other words, the analysis engine 308 may generate a cheater ‘rap sheet.’ The cheating users may then be monitored more often by the monitoring module 306 according to some embodiments or employed as a variable for generating future rules by the optional rules generator 302.

In some embodiments, the client 102 may include certain or all of the components discussed in FIG. 3 with regard to server 104 whereby device becomes more of a generic network node that may encompass server functionality, client functionality, both or neither (e.g., a router, buffer or intermediate point on a network). Accordingly, the client 102 can detect cheating activity occurring on other clients 102, as discussed herein. One node in the network may also generated queries of other nodes in response to an initial request by a server 104.

Nodes may also act in peer-groups whereby, for example, ten particular nodes constitute a group. Groups may be defined by the particular needs or nature of a particular network environment. For example, a group may constitute all players of a network game 104. A group may constitute all players of a network game 104 and participating via a particular ISP. A group may also constitute players in a certain ‘game room,’ that is, players that have been invited to participate with one another or otherwise entered a particular gaming environment of particular users. A group may be defined by any parameter that allows for delineation of one user from another (e.g., age, experience, game device being used, time logged on, type of network connection, bandwidth availability, etc.).

Other embodiments may provide for group participation in analysis of the query response. For example, multiple sending nodes may send a query to a particular receiving node. These queries may be identical or each request different information. In some embodiments, a correct response to the various queries may be required by all or a certain percentage of the querying nodes to further ensure the validity of the queried node in the community network.

Furthermore, although various components are discussed in connection with FIG. 3, the server 104 and/or the client 102 may include more or fewer components and still fall within the scope of various embodiments of the present invention.

FIG. 4 shows a flow diagram of an exemplary process for identifying illegal network game activity according to some embodiments of the present invention. The illegal network game activity may include, as discussed herein, violation of the rules associated with the network game 104 or any other cheating activity by the network game users.

At optional step 402 network game play is monitored. Monitoring of game play may, in some embodiments, only be implemented in passive validation architecture. Notwithstanding, the monitoring module 306 discussed in FIG. 3 can monitor user activity associated with the network game 104. As discussed herein, any type of monitoring, observation, and so forth may be employed.

At optional step 404, a determination whether there is anything unusual about a particular player's actions in the network game 104. Step 404 may, like step 402, be most appropriate in passive validation architecture. If no unusual activity is detected, the monitoring module 306 continues to monitor the network game user's activities in the network game 104.

If unusual activity is detected (e.g., in passive or hybrid validation architecture) or as might otherwise be scheduled or in response to a scheduled or randomized and asynchronous implementation of the query engine 310 (e.g., in active validation architecture), the query engine 310 sends a query to a client 102 (e.g., one that might be associated with unusual activity), at step 406. Based on the response to the query, the analysis engine 308 determines whether the unusual activity is illegal at step 408. If the node (e.g., client 102) is validated, the present query-response interaction comes to an end in the case of active validation architecture. In the case of passive or hybrid validation architecture, monitoring module 306 continues to monitor activity of node likes client 102 in the network.

If the node (e.g., client 102) is not validated, certain illegal activity may be resolved at step 410. As discussed herein, various resolutions may be employed, such as sending software to the node to add to, modify, or remove the offending software, warning the user at the offending node, creating a watch list concerning the offending client/user, and so forth.

At step 412, the server 108 or, in a peer-to-peer or group-peer scenario, the clients 102, determine whether to allow the network game user to continue to play in the network. If the network game user is allowed to continue to play, the node remains subject to future queries and/or monitoring in active, passive or hybrid validation architectures as is appropriate. If the network game user is not allowed to continue, the server 108 or the other clients 102 can eject the network game user, such as by ceasing data communication with the particular network game user. In some embodiments, the network game user that is not allowed to continue participating in the network game 104 is notified that the network game user is being ejected. In yet another embodiment, the network game user may be denied future participation in a particular network game or, in extreme cases, may be denied access to the gaming network or community.

Referring now to FIG. 5, a flow diagram of an exemplary process for actively validating network game users is shown as may be used in conjunction with the process of FIG. 4. At step 502, a query is sent to the one or more users. The query may be sent to the client 102 associated with the one or more users based on detected unusual activity, at specified intervals without detection of unusual activity, and so forth. Any method for determining when to send a query may be employed. As discussed herein, the query may be customized according to the network game user, the query may be predetermined, and so forth. The query may also comprise any type of query, such as a query requesting a specific area of the memory associated with the network game 104 or the network game user's participation in the game, a hash of the memory or specified area of the memory, a hash of the memory and a salt associated with the memory requested, identification of threads, modules, strings of data and so forth.

At step 504, an answer to the query is received. As discussed herein, in some embodiments, the one or more users may be ejected if the client 102 fails to respond to the query either correctly and/or in a timely fashion.

At step 506, it is determined whether the one or more users are valid based on the response to the query. As discussed herein, the network game user, may be considered valid if it is determined, by an analysis engine 308 at the server 108 or the other clients 102, that the network game user is not cheating, is not violating the rules associated with the network game 104, and so on. The response to the query may be utilized to further query the network game user where the response is not acceptable, or is otherwise suspicious.

The response may be analyzed by the analysis engine 308 in order to determine whether the network game user is valid. As discussed herein, the network game user may be warned, ejected from the network game 104, monitored, and so forth. As discussed herein, the violation or cheating may be resolved according to some embodiments, such as by sending data to add to, modify, or delete the cheating device, with or without notice to the network game user. Any type of resolution is within the scope of various embodiments of the present invention.

In some embodiments, as discussed herein, a list of cheating network game users may be generated and recorded, or stored. In other embodiments, a list of validated network game users may be generated. In other words, a list of the network game users that are not determined to be cheating may be generated, those users having established trust with the community over a period of time. Accordingly, the network game users that are validated may be monitored less while the network game users that have a history of cheating may be monitored more, according to some embodiments, or as may be determined by optional rules generator 302.

While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. For example, any of the elements associated with the client 102, the network game 104, and/or the server 108 may employ any of the desired functionality set forth hereinabove. Thus, the breadth and scope of a preferred embodiment should not be limited by any of the above-described exemplary embodiments.

The present invention may also be used in the context of validating certain permissions and/or copyright protections that may exist with regard to copyrighted content. Content may be validated through a query to verify whether a particular party or device has the authority to ‘play’ that content.

Further, the present invention may be used in the context of providing updates to various computing devices wherein it is determined that a portion of software (e.g., as may be determined through a query) is out-of-date and in need of updating or overwriting.

The present invention may be further implemented in a common network game 104 that is operable over a mixed network of end user devices (e.g., clients 102). For example, one client device 102 may be a personal computer; a second client device 102 may be a home entertainment system such as a PlayStation®2 or PlayStation®3 available from Sony Computer Entertainment Inc. Another client device 102 may be a portable gaming device such as a PSP™ (also from Sony Computer Entertainment Inc.) whereas a fourth client 102 may be a home entertainment system of a different manufacture such as an Xbox as manufactured by Microsoft Corporation or a GameCube as manufactured by Nintendo Co., Ltd. The present anti-cheat methodologies described herein are fully intended to be operable amongst a related or non-related group of devices. 

1. (canceled)
 2. A method for validating compliance of nodes in a peer-to-peer network with a rule, the method comprising: receiving a plurality of queries at a node in the peer-to-peer network, wherein each query from the plurality of queries originates from a different sending node in the peer-to-peer network; processing each of the plurality of queries to generate a corresponding response, wherein processing of each of the plurality of queries takes place at the node receiving the plurality of queries; and transmitting the generated responses to the corresponding sending nodes for each of the plurality of queries, the generated responses transmitted over one or more communications channels in the peer-to-peer network, and wherein the generated responses are subsequently analyzed to determine whether the node receiving the plurality of queries is in compliance with the rule.
 3. The method of claim 2, wherein the rule corresponds to a quantifiable limitation of the peer-to-peer network environment.
 4. The method of claim 2, wherein the rule corresponds to a quantifiable limitation of a game environment, wherein the node receiving the plurality of queries corresponds to a user that is a participant in the game environment.
 5. The method of claim 2, wherein the rule corresponds to a quantifiable limitation of a character in a game environment, wherein the node receiving the plurality of queries corresponds to a user controlling a character in the game environment.
 6. The method of claim 2, wherein the rule corresponds to a quantifiable limitation corresponding to an aspect of a video game and is selected from the group consisting of character fatigue, speed, character strength, goals, power, ammunition, temporal variables, score ranges, prerequisites for advancement, and frequency.
 7. The method of claim 2, wherein the generated responses are accumulated in an database corresponding to the node receiving the plurality of queries.
 8. The method of claim 7, further comprising receiving a further query from one or more of the sending nodes, the further query sent in response to an analysis of the database.
 9. The method of claim 2, wherein the receiving node is validated notwithstanding a failure to comply with the rule, the noncompliance with the rule corresponding to an excepted finding of noncompliance.
 10. The method of claim 9, wherein the excepted finding of noncompliance corresponds to functionality in a video game, the functionality implemented by a developer of the video game.
 11. The method of claim 9, wherein the excepted finding of noncompliance corresponds to functionality in a video game, the functionality implemented by a code unlocking the functionality.
 12. The method of claim 2, wherein the rule corresponds to an identifiable aspect of the node receiving the plurality of queries.
 13. The method of claim 12, wherein the identifiable aspect includes overwritten code in memory at the node receiving the plurality of queries.
 14. The method of claim 12, wherein the identifiable aspect includes modified code in memory at the node receiving the plurality of queries.
 15. The method of claim 12, wherein the identifiable aspect includes the presence of a hardware device coupled to the node receiving the plurality of queries.
 16. The method of claim 12, wherein the identifiable aspect includes the presence of a particular device signature at node receiving the plurality of queries.
 17. The method of claim 12, wherein the identifiable aspect includes the presence of certain data at the node receiving the plurality of queries.
 18. The method of claim 17, wherein the certain data includes an instruction thread.
 19. The method of claim 12, wherein the identifiable aspect includes blocking the exchange of particular data elements with another node in the peer-to-peer network.
 20. The method of claim 2, wherein at least two queries from the plurality of queries are identical.
 21. The method of claim 2, wherein each query from the plurality of queries differ from one another.
 22. The method of claim 2, wherein the node receiving the plurality of queries must provide a correct response to each of the plurality of queries in order to be found in compliance with the rule.
 23. The method of claim 2, wherein the node receiving the plurality of queries must provide a correct response to a predetermined percentage of each of the plurality of queries in order to be found in compliance with the rule.
 24. The method of claim 23, wherein the predetermined percentage is less than 100%.
 25. The method of claim 2, wherein the node receiving the plurality of queries receives fewer subsequent queries as a result of having been found to be in compliance with the rule. 